51 Algorithmic Motion Planning

نویسندگان

  • Dan Halperin
  • Oren Salzman
  • Micha Sharir
چکیده

Motion planning is a fundamental problem in robotics. It comes in a variety of forms, but the simplest version is as follows. We are given a robot system B, which may consist of several rigid objects attached to each other through various joints, hinges, and links, or moving independently, and a 2D or 3D environment V cluttered with obstacles. We assume that the shape and location of the obstacles and the shape of B are known to the planning system. Given an initial placement Z1 and a final placement Z2 of B, we wish to determine whether there exists a collisionavoiding motion of B from Z1 to Z2, and, if so, to plan such a motion. In this simplified and purely geometric setup, we ignore issues such as incomplete information, nonholonomic constraints, control issues related to inaccuracies in sensing and motion, nonstationary obstacles, optimality of the planned motion, and so on. Since the early 1980s, motion planning has been an intensive area of study in robotics and computational geometry. In this chapter we will focus on algorithmic motion planning, emphasizing theoretical algorithmic analysis of the problem and seeking worst-case asymptotic bounds, and only mention briefly practical heuristic approaches to the problem. The majority of this chapter is devoted to the simplified version of motion planning, as stated above. Section 51.1 presents general techniques and lower bounds. Section 51.2 considers efficient solutions to a variety of specific moving systems with a small number of degrees of freedom. These efficient solutions exploit various sophisticated methods in computational and combinatorial geometry related to arrangements of curves and surfaces (Chapter 30). Section 51.3 then briefly discusses various extensions of the motion planning problem such as computing optimal paths with respect to various quality measures, computing the path of a tethered robot, incorporating uncertainty, moving obstacles, and more.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UNDER-ACTUATED SPACE ROBOTS: PHYSICAL and ALGORITHMIC CONSTRAINTS in SMOOTH MOTION PLANNING

Space manipulator systems having spacecraft actuators turned off, operate in free-floating mode, and exhibit nonholonomic behaviour due to angular momentum conservation. The system is underactuated and a challenging problem is to control both the location of the end effector and the attitude of the base, using manipulator actuators only. A developed path planning method that perform this task i...

متن کامل

Interactive Planning for Shepherd Motion

Shepherding problem asks how the movement of an agent (e.g., predator, policeman, or sheepdog) can push a group of agents (e.g., prey, crowd, or sheep) from one position to another. The shepherding problem has many important and practical applications in security, environmental protection, agriculture, education and more. While much research has focused on simulating coordinated group behaviors...

متن کامل

Randomized Motion Planning: a Tutorial

Sampling demonstrated to be the algorithmic key to efficiently solve many high dimensional motion planning problems. Information on the configuration space is acquired by generating samples and edges between them, which are stored in a suitable data structure. Following this paradigm, many different algorithmic techniques have been proposed, and some of them are now widely accepted as part of t...

متن کامل

Motion planning algorithms for molecular simulations: A survey

Motion planning is a fundamental problem in robotics that has motivated research since more than three decades ago. A large variety of algorithms have been proposed to compute feasible motions of multi-body systems in constrained workspaces. In recent years, some of these algorithms have surpassed the frontiers of robotics, finding applications in other domains such as industrial manufacturing,...

متن کامل

50 Algorithmic Motion Planning

Motion planning is a fundamental problem in robotics. It comes in a variety of forms, but the simplest version is as follows. We are given a robot system B, which may consist of several rigid objects attached to each other through various joints, hinges, and links, or moving independently, and a 2D or 3D environment V cluttered with obstacles. We assume that the shape and location of the obstac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016